A dynamic free-entry oligopoly with sluggish entry and exit adjustments

We study a dynamic free-entry oligopoly with sluggish entry and exit of firms under general demand and cost functions. We show that the number of firms in a steady-state open-loop solution for a dynamic free-entry oligopoly is smaller than that at static equilibrium and that the number of firms in a steady-state memoryless closed-loop solution is larger than that in an open-loop solution.     

Solvability of a nonlinear fifth‐order difference equation

Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal.     

Unconditionally Superclose Analysis of a New Mixed Finite Element Method for Nonlinear Parabolic Equation

This paper develops a framework to deal with the unconditional superclose analysis of nonlinear parabolic equation. Taking the finite element pair $Q_{11}/Q_{01} × Q_{10}$ as an example, a new mixed finite element method (FEM) is established and the $τ$ -independent superclose results of the original variable $u$ in $H^1$-norm and the flux variable $\mathop{q} \limits ^{\rightarrow}= −a(u)∇u$ in $L^2$-norm are deduced ($τ$ is the temporal partition parameter). A key to our analysis is an error splitting technique, with which the time-discrete and the spatial-discrete systems are constructed, respectively. For the first system, the boundedness of the temporal errors is obtained. For the second system, the spatial superclose results are presented unconditionally, while the previous literature always only obtain the convergent estimates or require certain time step conditions. Finally, some numerical results are provided to confirm the theoretical analysis, and show the efficiency of the proposed method.     

Highly Sensitive AdSV Method for Fe(III) Determination in Presence of Solochrome Violet RS on Renewable Amalgam Film Electrode

The new DP AdSV method for high sensitive Fe(III) determination in the presence of Solochrome Violet RS was developed. The use of an innovative renewable amalgam film electrode Hg(Ag)FE allowed to obtain high sensitivity and significantly minimize the mercury consumption. The best results were obtained for surface area of Hg(Ag)FE equal to 11.8 mm². Instrumental parameters were optimized. The optimal results were obtained using differential pulse technique for the following values: sampling and waiting time ts=tw=10 ms, step potential Es=5 mV, pulse amplitude ΔE=50 mV. Measurements were conducted in 0.05 M acetate buffer (pH 5.6), the concentration of SVRS was equal to 5 μM. Deposition step was carried out at the potential ?400 mV for 20 s. Calculated detection limit for 40 s preconcentration time was equal to 1.4 nM (78 ng L^?1). The influence of the common in environment, organic and inorganic interferences was studied. The developed method for Fe(III) determination was successfully applied and validated by investigation of certified reference material SPS‐SW2 Batch 118 and recovery of Fe(III) from various spiked samples as snow, tap water and bottom sediments. The repeatability (for 50 nM of Fe(III)) of the developed method expressed as CV was equal 3.1 % (n=5).     

The double deflating technique for irreducible singular M-matrix algebraic Riccati equations in the critical case

As is known, Alternating-Directional Doubling Algorithm (ADDA) is quadratically convergent for computing the minimal nonnegative solution of an irreducible singular M-matrix algebraic Riccati equation (MARE) in the noncritical case or a nonsingular MARE, but ADDA is only linearly convergent in the critical case. The drawback can be overcome by deflating techniques for an irreducible singular MARE so that the speed of quadratic convergence is still preserved in the critical case and accelerated in the noncritical case. In this paper, we proposed an improved deflating technique to accelerate further the convergence speed – the double deflating technique for an irreducible singular MARE in the critical case. We proved that ADDA is quadratically convergent instead of linearly when it is applied to the deflated algebraic Riccati equation (ARE) obtained by a double deflating technique. We also showed that the double deflating technique is better than the deflating technique from the perspective of dimension of the deflated ARE. Numerical experiments are provided to illustrate that our double deflating technique is effective.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

On the Relative Gain Array (RGA) with singular and rectangular matrices

This paper identifies a significant deficiency in the literature on the application of the Relative Gain Array (RGA) formalism in the case of singular matrices. Specifically, it is shown that the conventional use of the Moore–Penrose pseudoinverse is inappropriate because it fails to preserve critical properties that can be assumed in the nonsingular case. It is then shown that such properties can be rigorously preserved using an alternative generalized matrix inverse.     

New classes of second order difference equations solvable by factorization method

Under some assumptions we find a general solution of the factorization problem for a family of second order difference equations.